Computational complexity theory

Results: 2049



#Item
191CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-03-15 10:47:56
192Computing Fundamentals Salvatore Filippone  2012–2013

Computing Fundamentals Salvatore Filippone 2012–2013

Add to Reading List

Source URL: people.uniroma2.it

Language: English - Date: 2014-09-23 08:12:56
193Computing Fundamentals Salvatore Filippone  2013–2014

Computing Fundamentals Salvatore Filippone 2013–2014

Add to Reading List

Source URL: people.uniroma2.it

Language: English - Date: 2014-09-23 08:13:16
194What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1  2

What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:56:55
195NP-complete Problems and Physical Reality  arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗

NP-complete Problems and Physical Reality arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗

Add to Reading List

Source URL: cqi.inf.usi.ch

Language: English - Date: 2012-02-22 09:04:08
196Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech

Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2008-08-04 00:47:22
197Modes and Cuts in Metabolic Networks: Complexity and Algorithms∗ Vicente Acu˜ na2,3 , Flavio Chierichetti1 , Vincent Lacroix2,3,6 , Alberto Marchetti-Spaccamela1 , Marie-France Sagot2,3 , Leen Stougie4,5

Modes and Cuts in Metabolic Networks: Complexity and Algorithms∗ Vicente Acu˜ na2,3 , Flavio Chierichetti1 , Vincent Lacroix2,3,6 , Alberto Marchetti-Spaccamela1 , Marie-France Sagot2,3 , Leen Stougie4,5

Add to Reading List

Source URL: pbil.univ-lyon1.fr

Language: English - Date: 2008-10-22 02:35:19
198Limitations of Quantum Advice and One-Way Communication

Limitations of Quantum Advice and One-Way Communication

Add to Reading List

Source URL: theoryofcomputing.org

Language: English - Date: 2014-11-14 13:01:57
199Efficient viewshed computation on terrain in external memory Marcus V. A. Andrade1,2 , Salles V. G. Magalh˜aes1 , Mirella A. Magalh˜aes1 , W. Randolph Franklin2 , and Barbara M. Cutler3 1 2

Efficient viewshed computation on terrain in external memory Marcus V. A. Andrade1,2 , Salles V. G. Magalh˜aes1 , Mirella A. Magalh˜aes1 , W. Randolph Franklin2 , and Barbara M. Cutler3 1 2

Add to Reading List

Source URL: www.cs.rpi.edu

Language: English - Date: 2009-11-19 21:17:30
200Innovations in Computer ScienceComputational Complexity and Information Asymmetry in Financial Products∗ (Extended Abstract) 1

Innovations in Computer ScienceComputational Complexity and Information Asymmetry in Financial Products∗ (Extended Abstract) 1

Add to Reading List

Source URL: users.cs.duke.edu

Language: English - Date: 2012-07-27 08:13:34